The Galois Connection between Operations and Relations
نویسنده
چکیده
sets of relations are denoted by Rel (<κ) A and Rel (<∞) A , respectively. For an operation f ∈ Op A and a relation ρ ∈ Rel (μ) A we say that f preserves ρ, or ρ is compatible with f , and write f ⊥ ρ, if f(ρ, ρ, . . .) ⊆ ρ. Equivalently, f preserves ρ iff ρ is a subalgebra of the algebra 〈A; f〉 iff f if a homomorphism 〈A; ρ〉 → 〈A; ρ〉 of relational structures. For any pair κ, λ where each one of κ, λ is either a cardinal or ∞, compatibility of operations and relations defines a Galois
منابع مشابه
Galois connection for multiple-output operations
It is a classical result from universal algebra that the notions of polymorphisms and invariants provide a Galois connection between suitably closed classes (clones) of finitary operations f : B n → B, and classes (coclones) of relations r ⊆ B k. We will present a generalization of this duality to classes of (multi-valued, partial) functions f : B n → B m , employing invariants valued in partia...
متن کاملAutomorphisms and strongly invariant relations
We investigate characterizations of the Galois connection sInv–Aut between sets of finitary relations on a base set A and their automorphisms. In particular, for A = ω1, we construct a set R of relations that is closed under all invariant operations on relations and under arbitrary intersections, but is not closed under sInv Aut.
متن کاملGalois Theory for Sets of Operations Closed under Permutation, Cylindrification and Composition
A set of operations on A is shown to be the set of linear term operations of some algebra on A if and only if it is closed under permutation of variables, addition of inessential variables and composition and it contains all projections. A Galois framework is introduced to describe the sets of operations that are closed under the operations mentioned above, not necessarily containing all projec...
متن کاملGalois Connection in Fuzzy Binary Relations, Applications for Discovering Association Rules and Decision Making
Galois connection in crisp binary relations has proved to be useful for several applications in computer science. Unfortunately, data is not always presented as a crisp binary relation but may be composed of fuzzy values, thus forming a fuzzy binary relation. This paper aims at defining the notion of fuzzy galois connection corresponding to a fuzzy binary relation in two steps: firstly by defin...
متن کاملar X iv : m at h / 03 09 16 5 v 1 [ m at h . L O ] 9 S ep 2 00 3 Automorphisms and strongly invariant relations
We investigate characterizations of the Galois connection sInv–Aut between sets of finitary relations on a base set A and their automorphisms. In particular, for A = ω1, we construct a countable set R of relations that is closed under all invariant operations on relations and under arbitrary intersections, but is not closed under sInvAut. Our structure (A, R) has an ω-categorical first order th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015